Weighted greatest common divisors and weighted heights
نویسندگان
چکیده
منابع مشابه
Divisibility and Greatest Common Divisors
Definition 2.1. When a and b are integers, we say a divides b if b = ak for some k ∈ Z. We then write a | b (read as “a divides b”). Example 2.2. We have 2 | 6 (because 6 = 2 · 3), 4 | (−12), and 5 | 0. We have ±1 | b for every b ∈ Z. However, 6 does not divide 2 and 0 does not divide 5. Divisibility is a relation, much like inequalities. In particular, the relation 2 | 6 is not the number 3, e...
متن کاملApproximate Greatest Common Divisors and Polynomials Roots
This lecture will show by example some of the problems that occur when the roots of a polynomial are computed using a standard polynomial root solver. In particular, polynomials of high degree with a large number of multiple roots will be considered, and it will be shown that even roundoff error due to floating point arithmetic, in the absence of data errors, is sufficient to cause totally inco...
متن کاملComputing Greatest Common Divisors and Factorizations
In a quadratic number field Q(V~D), D a squarefree integer, with class number 1, any algebraic integer can be decomposed uniquely into primes, but for only 21 domains Euclidean algorithms are known. It was shown by Cohn [5] that for D < —19 even remainder sequences with possibly nondecreasing norms cannot determine the GCD of arbitrary inputs. We extend this result by showing that there does no...
متن کاملPolynomial Division and Greatest Common Divisors
It is easy to see that there is at most one pair of polynomials (q(x), r(x)) satisfying (1); for if (q1(x), r1(x)) and (q2(x), r2(x)) both satisfy the relation with respect to the same polynomial u(x) and v(x), then q1(x)v(x)+r1(x) = q2(x)v(x)+r2(x), so (q1(x)− q2(x))v(x) = r2(x)−r1(x). Now if q1(x)− q2(x) is nonzero, we have deg((q1 − q2) · v) = deg(q1 − q2)+deg(v) ≥ deg(v) > deg(r2 − r1), a c...
متن کاملOrdered Groups with Greatest Common Divisors Theory
An embedding (called a GCD theory) of partly ordered abelian group G into abelian l-group Γ is investigated such that any element of Γ is an infimum of a subset (possible non-finite) from G. It is proved that a GCD theory need not be unique. A complete GCD theory is introduced and it is proved that G admits a complete GCD theory if and only if it admits a GCD theory G Γ such that Γ is an Archim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2020
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2019.12.012